The core inverse and constrained matrix approximation problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولMatrix representation of a sixth order Sturm-Liouville problem and related inverse problem with finite spectrum
In this paper, we find matrix representation of a class of sixth order Sturm-Liouville problem (SLP) with separated, self-adjoint boundary conditions and we show that such SLP have finite spectrum. Also for a given matrix eigenvalue problem $HX=lambda VX$, where $H$ is a block tridiagonal matrix and $V$ is a block diagonal matrix, we find a sixth order boundary value problem of Atkin...
متن کاملCore Problem within Linear Approximation
Abstract. This paper focuses on total least squares (TLS) problems AX ≈ B with multiple right-hand sides. Existence and uniqueness of a TLS solution for such problems was analyzed in the paper [I. Hnětynková, M. Plešinger, D. M. Sima, Z. Strakoš, and S. Van Huffel (2011)]. For TLS problems with single right-hand sides the paper [C. C. Paige and Z. Strakoš (2006)] showed how a necessary and suff...
متن کاملDiscrete approximation and regularisation for the inverse conductivity problem
We study the inverse conductivity problem with discontinuous conductivities. We consider, simultaneously, a regularisation and a discretisation for a variational approach to solve the inverse problem. We show that, under suitable choices of the regularisation and discretisation parameters, the discrete regularised solutions converge, as the noise level on the measurements goes to zero, to the l...
متن کاملComplexity and approximation of the Constrained Forest problem
Given an undirected graph on n vertices with weights on its edges, Min WCF(p) consists of computing a covering forest of minimum weight such that each of its tree components contains at least p vertices. It has been proved that Min WCF(p) is NP -hard for any p ≥ 4 (Imielinska et al., 1993) but (2− 1 n )-approximable (Goemans andWilliamson, 1995). While Min WCF(2) is polynomial-time solvable, al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Mathematics
سال: 2020
ISSN: 2391-5455
DOI: 10.1515/math-2020-0178